Comment on "New Results on Frame-Proof Codes and Traceability Schemes"
نویسندگان
چکیده
In the paper “New Results on Frame-Proof Codes and Traceability Schemes” by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029– 3033, Nov. 2001], there are lower bounds for the maximal number of codewords in binary frame-proof codes and decoders in traceability schemes. There are also existence proofs using a construction of binary frame-proof codes and traceability schemes. Here it is found that the main results in the referenced paper do not hold.
منابع مشابه
New results on frame-proof codes and traceability schemes
In this correspondence we derive lower bounds on the maximum number of codewords in a class of frameproof codes and traceability schemes, and give constructions for both with more codewords than the best known.
متن کاملAnother proof of Banaschewski's surjection theorem
We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...
متن کاملEnhancing privacy of recent authentication schemes for low-cost RFID systems
Nowadays Radio Frequency Identification (RFID) systems have appeared in lots of identification and authentication applications. In some sensitive applications, providing secure and confidential communication is very important for end-users. To this aim, different RFID authentication protocols have been proposed, which have tried to provide security and privacy of RFID users. In this paper, we a...
متن کاملOn a Class of Traceability Codes
Traceability codes are designed to be used in schemes that protect copyrighted digital data against piracy. The main aim of this paper is to give an answer to a Staddon-Stinson-Wei’s problem of the existence of traceability codes with q < w and b > q. We provide a large class of these codes constructed by using a new general construction method for q-ary codes.
متن کاملSome Remarks about a Possible New Standard
The Consultative Committee for Space Data Systems (CCSDS) Telemetry Channel Coding standard must be updated for near-future missions characterized by high data rates and high spectral efficiency. New coding schemes satisfying these requirements are studied and compared in this paper. The attention is focused on turbo codes, product codes and low density parity check codes. Proper design is perf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 56 شماره
صفحات -
تاریخ انتشار 2010